Ken Kunen: Algebraist
نویسنده
چکیده
Ken Kunen is justifiably best known for his work in set theory and topology. What I would guess many of his friends and students in those areas do not know is that Ken also did important work in algebra, especially in quasigroup and loop theory. In fact, I think it is not an exaggeration to say that his work in loop theory, both alone and in collaboration, revolutionized the field. In this paper, I would like to describe some of his accomplishments to nonspecialists. My point of view is personal, of course, and so I will give the most attention to those of his projects in which he collaborated with me. My hope is that the set theorists and topologists reading this will come away with an appreciation for what Ken was able to do in an area outside of his direct speciality. In the interest of space, I will have to leave out discussion of some of Ken’s work, such as his paper on alternative loop rings [15]. Ken’s approach to algebra utilized automated deduction tools and finite model builders. At the time most of what I am going to describe took place, the automated deduction software of choice was OTTER, developed by William McCune [18]. (McCune is best known to mathematicians for his solution to the Robbins Problem in Boolean algebras [20].) The finite model builder Ken used during the period I will discuss was SEM, developed by J. Zhang and H. Zhang [23]. In recent years, these have been supplanted by other tools, such as McCune’s Prover9, a successor to OTTER, and McCune’s model builder Mace4 [19].
منابع مشابه
Covering dimension and finite-to-one maps
To Ken Kunen on the occasion of his retirement from teaching MSC: primary 54F45 secondary 54C10, 54G05
متن کاملEssential Kurepa Trees versus Essential Jech-Kunen Trees
By an !1{tree we mean a tree of cardinality !1 and height !1. An !1{tree is called a Kurepa tree if all its levels are countable and it has more than !1 branches. An !1{tree is called a Jech{Kunen tree if it has branches for some strictly between !1 and 2 1. A Kurepa tree is called an essential Kurepa tree if it contains no Jech{Kunen subtrees. A Jech{Kunen tree is called an essential Jech{Kune...
متن کاملA Model in Which There Are Jech–kunen Trees but There Are No Kurepa Trees
By an ω1–tree we mean a tree of power ω1 and height ω1. We call an ω1–tree a Jech–Kunen tree if it has κ–many branches for some κ strictly between ω1 and 21 . In this paper we construct the models of CH plus 21 > ω2, in which there are Jech–Kunen trees and there are no Kurepa trees. An partially ordered set, or poset for short, 〈T,<T 〉 is called a tree if for every t ∈ T the set {s ∈ T : s <T t...
متن کامل. L O ] 1 5 N ov 1 99 2 Planting Kurepa Trees And Killing Jech – Kunen Trees In a Model By Using One Inaccessible Cardinal
By an ω1–tree we mean a tree of power ω1 and height ω1 . Under CH and 21 > ω2 we call an ω1–tree a Jech–Kunen tree if it has κ many branches for some κ strictly between ω1 and 2 ω1 . In this paper we prove that, assuming the existence of one inaccessible cardinal, (1) it is consistent with CH plus 21 > ω2 that there exist Kurepa trees and there are no Jech–Kunen trees, which answers a question ...
متن کاملSome Category-Theoretic Ideas in Algebra (A Too-Brief Tour of Algebraic Structure, Monads, and the Adjoint Tower)
In recent years, categorists have come up with some very interesting ways of looking at algebraic constructions and algebraic objects. But most of what they write on this is technical and aimed at other categorists. I shall sketch some of these ideas here, emphasizing concrete examples, for the algebraist with a reasonable foundation in category theory (familiarity with adjoint functors and col...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011